- one-way trapdoor function
- <08> функция с секретом
Сборный англо-русский словарь. Академик.ру. 2011.
one-way trapdoor function
Смотреть что такое "one-way trapdoor function" в других словарях:
One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… … Wikipedia
Trapdoor function — A trapdoor function is a function that is easy to compute in one direction, yet believed to be difficult to compute in the opposite direction (finding its inverse) without special information, called the trapdoor . Trapdoor functions are widely… … Wikipedia
One-way encryption — In cryptography, the term one way encryption has been used to refer to a number of different things: *One way function, a function difficult to invert. Note that encryption is, by definition, reversible. Hence, the term one way encryption is… … Wikipedia
Efficient Probabilistic Public-Key Encryption Scheme — EPOC (Efficient Probabilistic Public Key Encryption) is a probabilistic public key encryption scheme.EPOC was developed in 1999 by T. Okamoto, S. Uchiyama and E. Fujisaki of NTT Labs in Japan. It is based on the random oracle model, in which a… … Wikipedia
Claw-free permutation — In mathematical and computer science field of cryptography, a group of three numbers (x,y,z) is said to be a claw of two permutations f0 and f1 if f0(x) = f1(y) = z. A pair of permutations f0 and f1 are said to be claw free if there is no… … Wikipedia
Digital signature — This article is about secure cryptographic signatures. For simple signatures in digital form, see Electronic signature. A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital… … Wikipedia
Pseudorandom generator theorem — In computational complexity a distribution is considered pseudorandom if no efficient computation can distinguish it from the true uniform distribution by a non negligible advantage. Formally, a family of distributions Dn is pseudorandom if for… … Wikipedia
Hard-core predicate — In cryptography, a hard core predicate of a one way function f is a predicate b (i.e., a function whose output is a single bit) which is easy to compute given x but is hard to compute given f(x) . In formal terms, there is no probabilistic… … Wikipedia
Optimal Asymmetric Encryption Padding — This article is about the padding scheme used in public key cryptography. For the division of the Thailand Ministry of Science Technology and Environment entitled Office of Atomic Energy for Peace, see [http://www.oaep.go.th/english/index.html] … Wikipedia
Optimal asymmetric encryption padding — This article is about the padding scheme used in public key cryptography. For the division of the Thailand Ministry of Science Technology and Environment entitled Office of Atomic Energy for Peace, see [1]. In cryptography, Optimal Asymmetric… … Wikipedia
Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia
